Linear Search Visualization

A[0] A[1] A[2] A[3] A[4] A[5] A[6] A[7] A[8] A[9] A[10]
0 1 2 3 4 5 6 7 8 9 10


 

      




Pseudo Code

  • procedure linear_search (list, value)
  •  while i < n
  •      if match item == value
  •       return the item's location
  •      i++
  • end while
  • end procedure